Probabilistic Asynchronous pi-Calculus
نویسندگان
چکیده
We propose an extension of the asynchronous π-calculus with a notion of random choice. We define an operational semantics which distinguishes between probabilistic choice, made internally by the process, and nondeterministic choice, made externally by an adversary scheduler. This distinction will allow us to reason about the probabilistic correctness of algorithms under certain schedulers. We show that in this language we can solve the electoral problem, which was proved not possible in the asynchronous π-calculus. Finally, we show an implementation of the probabilistic asynchronous π-calculus in a Java-like language.
منابع مشابه
The Probabilistic Asynchronous Pi - Calculus
In this dissertation, we consider a distributed implementation of the π-calculus, more precisely, the version of the π-calculus with mixed choice. To this end, we present the probabilistic asynchronous π-calculus, which is an extension of the asynchronous πcalculus enhanced with a notion of random choice. We define an operational semantics which distinguishes between probabilistic choice, made ...
متن کاملA New-type Pi Calculus with Buffers and Its Bisimulation
According to the features of asynchronous interaction in systems, a new-type Pi calculus with buffers — Buffer-Pi calculus is proposed, the new labelled transition system based on buffers is introduced, the enhanced describing capability is shown to apply Buffer-Pi calculus to modeling with the concrete example of asynchronous interaction, and the new behavior equivalence relations are defined,...
متن کاملA Randomized Distributed Encoding of the Pi-Calculus with Mixed Choice
We consider the problem of encoding the -calculus (more precisely, the version of the -calculus with mixed choice) into the asynchronous -calculus via a uniform translation preserving a reasonable semantics. Although it has been shown that this is not possible with an exact encoding, we suggest a randomized approach using a probabilistic extension of the asynchronous -calculus, and we show that...
متن کاملA randomized encoding of the Pi-calculus with mixed choice
We consider the problem of encoding the π-calculus with mixed choice into the asynchronous π-calculus via a uniform translation while preserving a reasonable semantics. Although it has been shown that this is not possible with an exact encoding, we suggest a randomized approach using a probabilistic extension of the asynchronous π-calculus, and we show that our solution is correct with probabil...
متن کاملComputational Secrecy by Typing for the Pi Calculus
We define and study a distributed cryptographic implementation for an asynchronous pi calculus. At the source level, we adapt simple type systems designed for establishing formal secrecy properties. We show that those secrecy properties have counterparts in the implementation, not formally but at the level of bitstrings, and with respect to probabilistic polynomial-time active adversaries. We r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000